Spreaders in the Network SIR Model: An Empirical Study

نویسندگان

  • Brian Macdonald
  • Paulo Shakarian
  • Nicholas Howard
  • Geoffrey Moores
چکیده

We use the susceptible-infected-recovered (SIR) model for disease spread over a network, and empirically study how well various centrality measures perform at identifying which nodes in a network will be the best spreaders of disease on 10 real-world networks. We find that the relative performance of degree, shell number and other centrality measures can be sensitive to β , the probability that an infected node will transmit the disease to a susceptible node. We also find that eigenvector centrality performs very well in general for values of β above the epidemic threshold.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Community-Based Approach to Identifying Influential Spreaders

Identifying influential spreaders in complex networks has a significant impact on understanding and control of spreading process in networks. In this paper, we introduce a new centrality index to identify influential spreaders in a network based on the community structure of the network. The community-based centrality (CbC) considers both the number and sizes of communities that are directly li...

متن کامل

Leveraging percolation theory to single out influential spreaders in networks

Among the consequences of the disordered interaction topology underlying many social, technological, and biological systems, a particularly important one is that some nodes, just because of their position in the network, may have a disproportionate effect on dynamical processes mediated by the complex interaction pattern. For example, the early adoption of a commercial product by an opinion lea...

متن کامل

Identifying Influential Spreaders by Weighted LeaderRank

Identifying influential spreaders is crucial for understanding and controlling spreading processes on social networks. Via assigning degree-dependent weights onto links associated with the ground node, we proposed a variant to a recent ranking algorithm named LeaderRank [L. Lü et al., PLoS ONE 6 (2011) e21202]. According to the simulations on the standard SIR model, the weighted LeaderRank perf...

متن کامل

Identifying influential spreaders in complex networks based on gravity formula

How to identify the influential spreaders in social networks is crucial for accelerating/hindering information diffusion, increasing product exposure, controlling diseases and rumors, and so on. In this paper, by viewing the k-shell value of each node as its mass and the shortest path distance between two nodes as their distance, then inspired by the idea of the gravity formula, we propose a gr...

متن کامل

Finding Near-Optimal Groups of Epidemic Spreaders in a Complex Network

In this paper, we present algorithms to find near-optimal sets of epidemic spreaders in complex networks. We extend the notion of local-centrality, a centrality measure previously shown to correspond with a node's ability to spread an epidemic, to sets of nodes by introducing combinatorial local centrality. Though we prove that finding a set of nodes that maximizes this new measure is NP-hard, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1208.4269  شماره 

صفحات  -

تاریخ انتشار 2012